The Kähler Mean of Block-Toeplitz Matrices with Toeplitz Structured Blocks

نویسندگان

  • Ben Jeuris
  • Raf Vandebril
چکیده

When computing an average of positive definite (PD) matrices, the preservation of additional matrix structure is desirable for interpretations in applications. An interesting and widely present structure is that of PD Toeplitz matrices, which we endow with a geometry originating in signal processing theory. As an averaging operation, we consider the barycenter, or minimizer of the sum of squared intrinsic distances. The resulting barycenter, the Kähler mean, is discussed along with its origin. Also, a generalization of the mean towards PD (Toeplitz-Block) Block-Toeplitz matrices is discussed. For PD Toeplitz-Block Block-Toeplitz matrices, we derive the generalized barycenter, or generalized Kähler mean, and a greedy approximation. This approximation is shown to be close to the generalized mean with a significantly lower computational cost.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Superfast inversion of two-level Toeplitz matrices using Newton iteration and tensor-displacement structure

A fast approximate inversion algorithm is proposed for two-level Toeplitz matrices (block Toeplitz matrices with Toeplitz blocks). It applies to matrices that can be sufficiently accurately approximated by matrices of low Kronecker rank and involves a new class of tensor-displacement-rank structured (TDS) matrices. The complexity depends on the prescribed accuracy and typically is o(n) for matr...

متن کامل

Kronecker product approximations for dense block Toeplitz-plus-Hankel matrices

In this paper, we consider the approximation of dense block Toeplitz-plus-Hankel matrices by sums of Kronecker products. We present an algorithm for efficiently computing the matrix approximation that requires the factorization of matrices of much smaller dimension than that of the original. The main results are described for block Toeplitz matrices with Toeplitz-plus-Hankel blocks (BTTHB), but...

متن کامل

Block Diagonal and Schur Complement Preconditioners for Block-Toeplitz Systems with Small Size Blocks

Abstract. In this paper we consider the solution of Hermitian positive definite block-Toeplitz systems with small size blocks. We propose and study block diagonal and Schur complement preconditioners for such block-Toeplitz matrices. We show that for some block-Toeplitz matrices, the spectra of the preconditioned matrices are uniformly bounded except for a fixed number of outliers and this fixe...

متن کامل

On the maximum rank of Toeplitz block matrices of blocks of a given pattern

We show that the maximum rank of block lower triangular Toeplitz block matrices equals their term rank if the blocks fulfill a structural condition, i.e., only the locations but not the values of their nonzeros are fixed.

متن کامل

On inverse eigenvalue problems for block Toeplitz matrices with Toeplitz blocks

We propose an algorithm for solving the inverse eigenvalue problem for real symmetric block Toeplitz matrices with symmetric Toeplitz blocks. It is based upon an algorithm which has been used before by others to solve the inverse eigenvalue problem for general real symmetric matrices and also for Toeplitz matrices. First we expose the structure of the eigenvectors of the so-called generalized c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 37  شماره 

صفحات  -

تاریخ انتشار 2016